Constant-Distortion Embeddings of Hausdorff Metrics into Constant-Dimensional l_p Spaces
نویسندگان
چکیده
We show that the Hausdorff metric over constant-size pointsets in constant-dimensional Euclidean space admits an embedding into constant-dimensional `∞ space with constant distortion. More specifically for any s, d ≥ 1, we obtain an embedding of the Hausdorff metric over pointsets of size s in d-dimensional Euclidean space, into `s ∞ with distortion sO(s+d). We remark that any metric space M admits an isometric embedding into `∞ with dimension proportional to the size of M . In contrast, we obtain an embedding of a space of infinite size into constant-dimensional `∞. We further improve the distortion and dimension trade-offs by considering probabilistic embeddings of the snowflake version of the Hausdorff metric. For the case of pointsets of size s in the real line of bounded resolution, we obtain a probabilistic embedding into ` log s) 1 with distortion O(s). 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems
منابع مشابه
Least-Distortion Euclidean Embeddings of Graphs: Products of Cycles and Expanders
Embeddings of finite metric spaces into Euclidean space have been studied in several contexts: The local theory of Banach spaces, the design of approximation algorithms, and graph theory. The emphasis is usually on embeddings with the least possible distortion. That is, one seeks an embedding that minimizes the bi-Lipschitz constant of the mapping. This question has also been asked for embeddin...
متن کاملLower Bounds on Embeddings of Planar Graphs into the l1 Metric
This paper presents an overview of existing bounds on l1-embeddings of planar metrics. A new family of graphs containing the K2,3 minor is introduced. Computational results on this family of graphs establish a new lower bound on the constant in the following conjecture: There exists an absolute constant Cmax > 0 such that every finite planar metric embeds into the l1 metric with distortion < Cm...
متن کاملApproximation Algorithms for Bounded Dimensional Metric Spaces
The study of finite metrics is an important area of research, because of its wide applications to many different problems. The input of many problems (for instance clustering, near-neighbor queries and network routing) naturally involves a set of points on which a distance function has been defined. Hence, one would be motivated to store and process metrics in an efficient manner. The central i...
متن کاملBounded Geometries, Fractals, and Low-Distortion Embeddings
The doubling constant of a metric space (X; d) is the smallest value such that every ball in X can be covered by balls of half the radius. The doubling dimension of X is then defined as dim(X) = log2 . A metric (or sequence of metrics) is called doubling precisely when its doubling dimension is bounded. This is a robust class of metric spaces which contains many families of metrics that occur i...
متن کاملComputational metric embeddings
We study the problem of computing a low-distortion embedding between two metric spaces. More precisely given an input metric space M we are interested in computing in polynomial time an embedding into a host space M ′ with minimum multiplicative distortion. This problem arises naturally in many applications, including geometric optimization, visualization, multi-dimensional scaling, network spa...
متن کامل